On LLP(k) parsers
نویسندگان
چکیده
منابع مشابه
Training Parsers on Incompatible Treebanks
We consider the problem of training a statistical parser in the situation when there are multiple treebanks available, and these treebanks are annotated according to different linguistic conventions. To address this problem, we present two simple adaptation methods: the first method is based on the idea of using a shared feature representation when parsing multiple treebanks, and the second met...
متن کاملOn LR(k)-Parsers of Polynomial Size
Usually, a parser for an LR(k)-grammar G is a deterministic pushdown transducer which produces backwards the unique rightmost derivation for a given input string x ∈ L(G). The best known upper bound for the size of such a parser is O(2|G||Σ| +k log |Σ|+log |G|) where |G| and |Σ| are the sizes of the grammar G and the terminal alphabet Σ, respectively. If we add to a parser the possibility to ma...
متن کاملOn Multilingual Training of Neural Dependency Parsers
We show that a recently proposed neural dependency parser can be improved by joint training on multiple languages from the same family. The parser is implemented as a deep neural network whose only input is orthographic representations of words. In order to successfully parse, the network has to discover how linguistically relevant concepts can be inferred from word spellings. We analyze the re...
متن کاملXML Parsers
XML parsers are typically used to transform raw XML data to a form that other applications can utilize. The parser may ensure that the document is well-formed1 and valid 2. It is a rather straightforward procedure to generate an XML document from an application. However, the opposite operation, retrieving data from XML within a program is a complicated procedure. In addition, being a rather new...
متن کاملEvaluation of Dependency Parsers on Unbounded Dependencies
We evaluate two dependency parsers, MSTParser and MaltParser, with respect to their capacity to recover unbounded dependencies in English, a type of evaluation that has been applied to grammarbased parsers and statistical phrase structure parsers but not to dependency parsers. The evaluation shows that when combined with simple post-processing heuristics, the parsers correctly recall unbounded ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1982
ISSN: 0022-0000
DOI: 10.1016/0022-0000(82)90054-x